Drivers’ parking location choice under uncertain parking availability and search times: A stated preference experiment
نویسندگان
چکیده
منابع مشابه
A Model for Dynamic Parking Choice of Drivers
Taking time-varying parking demands and supplies into account, this paper develops a dynamic parking choice model to simulate drivers’ searching for parking spaces between parking lots. In this study, each parking lot has one access passage and vehicles can move or wait for entering the park in the access passage. The flow propagation formula in the access passage of parking lots is established...
متن کاملParking search equilibrium and its implications for parking management
Parking is an underappreciated issue in urban traffic modeling and control, and drivers searching for a parking space can contribute substantially to congestion. New technologies and algorithms aim to smooth the parking search process, using sensors for dynamic pricing, transmitting availability information to drivers, or to allow advance reservation of spaces. However, the parking search proce...
متن کاملParking Emergency Parking Permit Parking Courtesy
MAIN CAMPUS PHONE NUMBERS AREA CODE: 949 Information Operator (8 a.m.-5 p.m., Mon.-Fri.) 824-5011 Admissions & Relations with Schools/Undergraduate 824-6703 Alumni Association 824-ALUM (2586) Applied Innovation 824-COVE (2683) Arts Box Office 824-ARTS (2787) Athletics 824-6931 Bookstore (The Hill) 824-BOOK (2665) Bren Events Center Ticket Office 824-5000 Campus Recreation 824-5346 Career Center...
متن کاملFrom Modeling Parking Search to Establishing Parking Policy
The paper presents a conceptual view and explicit agent-based model of parking in a city. Driver-agents behave within a high-resolution GIS database of the street network and parking facilities. They drive towards their destination, search for parking, park for a given interval of time, and leave the network. During parking search, driver-agents estimate the availability of parking places, thei...
متن کاملProbabilistic Routing for On-Street Parking Search
An estimated 30 % of urban traffic is caused by search for parking spots [8]. Suggesting routes along highly probable parking spots could reduce traffic. In this paper, we formalize parking search as a probabilistic problem on a road graph and show that it is NP-complete. We explore heuristics that optimize for the driving duration and the walking distance to the destination. Routes are constra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Part A: Policy and Practice
سال: 2015
ISSN: 0965-8564
DOI: 10.1016/j.tra.2015.10.004